Content Delivery Over Broadcast Erasure Channels With Distributed Random Cache

We study the content delivery problem between a transmitter and two receivers through erasure links, when each receiver has access to some random side-information about files requested by other user. The is cached at via decentralized placement. distributed nature of receiving terminals may also make it harder for learn state links indices files. thus investigate capacity gain due various levels availability channel cache index information transmitter. More precisely, we cover wide range settings from global delayed knowledge non-blind (i.e., one that knows exact receiver) all way no blind only statistically receivers). derive new inner outer bounds under provide conditions which match region characterized. Surprisingly, interesting cases, remains unchanged even with single-user or